Term Graph Rewriting and Parallel Term Rewriting
نویسندگان
چکیده
منابع مشابه
Term Graph Rewriting and Parallel Term Rewriting
The relationship between Term Graph Rewriting and Term Rewriting is well understood: a single term graph reduction may correspond to several term reductions, due to sharing. It is also known that if term graphs are allowed to contain cycles, then one term graph reduction may correspond to infinitely many term reductions. We stress that this fact can be interpreted in two ways. According to the ...
متن کاملUniversit a Di Pisa (cyclic) Term Graph Rewriting Is Adequate for Rational Parallel Term Rewriting (cyclic) Term Graph Rewriting Is Adequate for Rational Parallel Term Rewriting ?
Acyclic Term Graphs are able to represent terms with sharing , and the relationship between Term Graph Rewriting (TGR) and Term Rewrtiting (TR) is now well understood BvEG + 87, HP91]. During the last years, some researchers considered the extension of TGR to possibly cyclic term graphs, which can represent possibly innnite, rational terms. In KKSdV94] the authors formalize the classical relati...
متن کاملMonstr: Term Graph Rewriting for Parallel Machines
Term graphs locally look like terms, but globally have a more general directed graph structure. A rewriting model gives term graph rule systems an operational semantics and makes them into a general model of computation which one might hope to implement directly on a suitable architecture. Unfortunately, if the architecture is not basically sequential, the demands of the model are too great to ...
متن کاملTerm Graph Rewriting 5 4 Adequacy of Graph Rewriting for Term Rewriting 8 5 Implementing Term Rewriting
Recently, many techniques have been introduced that allow the (automated) classification of the runtime complexity of term rewrite systems (TRSs for short). In earlier work, the authors have shown that for confluent TRSs, innermost polynomial runtime complexity induces polytime computability of the functions defined. In this paper, we generalise the above result to full rewriting. Following our...
متن کاملTransitive Term Graph Rewriting
A version of generalised term graph rewriting is presented in which redirections are interpreted transitively. It is shown that the new semantics enjoy enhanced properties regarding ease of implementation on distributed machines compared with conventional semantics because of the Church-Rosser properties of transitive redirections. Furthermore, the good properties of orthogonal systems are larg...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Electronic Proceedings in Theoretical Computer Science
سال: 2011
ISSN: 2075-2180
DOI: 10.4204/eptcs.48.3